Scott Aaronson - PDFSEARCH.IO - Document Search Engine

Scott Aaronson
Results: 49

#	Item
21	Who Can Name the Bigger Number? Scott Aaronson∗ 1999 In an old joke, two noblemen vie to name the bigger number. The first, after ruminating for hours, triumphantly announces ”Eighty-three!” The second, Add to Reading List Source URL: homepages.math.uic.edu Language: English - Date: 2013-03-08 12:40:06
22	The Learnability of Quantum States Scott Aaronson∗ MIT Abstract Traditional quantum state tomography requires a number of measurements that grows exponentially Add to Reading List Source URL: www.scottaaronson.com Language: English - Date: 2008-11-13 22:47:28
23	A FULL CHARACTERIZATION OF QUANTUM ADVICE∗ SCOTT AARONSON† AND ANDREW DRUCKER‡ Abstract. We prove the following surprising result: given any quantum state ρ on n qubits, there exists a local Hamiltonian H on poly Add to Reading List Source URL: www.scottaaronson.com Language: English - Date: 2014-02-22 14:06:38
24	Quantum Computing, Postselection, and Probabilistic Polynomial-Time Scott Aaronson∗ Institute for Advanced Study, Princeton, NJ (USA) Add to Reading List Source URL: www.scottaaronson.com Language: English - Date: 2006-11-24 03:52:38
25	Advice Coins for Classical and Quantum Computation Scott Aaronson∗ Andrew Drucker† Abstract Add to Reading List Source URL: www.scottaaronson.com Language: English - Date: 2015-04-22 11:25:30
26	BosonSampling Is Far From Uniform Scott Aaronson∗ Alex Arkhipov† Abstract Add to Reading List Source URL: www.scottaaronson.com Language: English - Date: 2013-09-30 23:39:46
27	Why Philosophers Should Care About Computational Complexity Scott Aaronson∗ Abstract One might think that, once we know something is computable, how efficiently it can be computed is a practical question with little fu Add to Reading List Source URL: www.scottaaronson.com Language: English - Date: 2015-06-29 18:20:41 Computational complexity theory Theory of computation Complexity classes Mathematical optimization Structural complexity theory Models of computation P versus NP problem NP Reduction Time complexity Oracle machine Low
28	Generation of Universal Quantum Linear Optics by Any Beamsplitter Adam Bouland Based on joint work with Scott Aaronson Add to Reading List Source URL: www.quantum-lab.org Language: English - Date: 2015-02-25 18:00:26
29	Who Can Name the Bigger Number? Scott Aaronson∗ 1999 In an old joke, two noblemen vie to name the bigger number. The first, after ruminating for hours, triumphantly announces ”Eighty-three!” The second, Add to Reading List Source URL: www.scottaaronson.com Language: English - Date: 2008-12-18 11:10:27 Theory of computation Computability theory Busy beaver Computable function Computability Turing machine Halting problem Hypercomputation Computable number Algorithm Alan Turing Ackermann function
30	A Counterexample to the Generalized Linial-Nisan Conjecture Scott Aaronson∗ Abstract In earlier work [1], we gave an oracle separating the relational versions of BQP and the polynomial hierarchy, and showed that an ora Add to Reading List Source URL: www.scottaaronson.com Language: English - Date: 2010-07-11 20:15:23 Quantum complexity theory Bounded-error probabilistic polynomial Pseudorandom generator Fourier transform IP FO Theoretical computer science Applied mathematics PP

UPDATE